Recursive statistics on words
نویسندگان
چکیده
منابع مشابه
Recursive statistics on words
We describe a general machine for constructing statistics on words with a certain recursive structure. The classical Mahonian statistics, major index and inversion number, are examples, as are more modern Mahonian statistics, including those of Zeilberger and Bressoud, Denert, Han, Rawlings and Kadell. We give simple recursive procedures for calculating these statistics, as well as statistic-pr...
متن کاملGraphical Mahonian Statistics on Words
Foata and Zeilberger defined the graphical major index, majU , and the graphical inversion index, invU , for words over the alphabet {1, 2, . . . , n}. These statistics are a generalization of the classical permutation statistics maj and inv indexed by directed graphs U . They showed that majU and invU are equidistributed over all rearrangement classes if and only if U is bipartitional. In this...
متن کاملHypergeometric identities associated with statistics on words
The purpose of this note is to show how combinatorial arguments can produce nontrivial identities between hypergeometric q-series in two variables. This will be illustrated by using as examples 1. the major index of a binary word 2. the Durfee square size of an integer partition 3. the number of inversions in a binary word 4. the number of descents in a binary word 5. the sum of the positions o...
متن کاملEstimating Statistics on Words Using Ambiguous Descriptions
In this article we propose an alternative way to prove some recent results on statistics on words, such as the expected number of runs or the expected sum of the run exponents. Our approach consists in designing a general framework, based on the symbolic method developed in analytic combinatorics. The descriptions obtained in this framework are built in such a way that the degree of ambiguity o...
متن کاملWords within words: lexical statistics and lexical access
This paper presents lexical statistics on the pattern of occurrence of words embedded in other words. We report the results of an analysis of 25000 words, varying in length from two to six syllables, extracted from a phonetically-coded English dictionary (The Longman Dictionary of Contemporary English). Each syllable, and each string of syllables within each word was checked against the diction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)83013-5